۱ ۰
[توسط کاربر]
[مهندسی کامپیوتر]

3.1 Constraint Programming Foremost Constraint Programming is used where we have already completely collected the input information, so we start the cost function calculations after we are aware of the VM requirements. Since this approach can always consider additional constraints, it can always be expandable. However, in cases where we have several constraints to take into consideration, this approach may take too much time to find the most suitable VM placement. Therefore, the main challenge consists in finding the optimal solution before any modification in terms of the constraint parameters. Although this approach formally expresses the demands of VMs in terms of constraints, it has been modestly adopted. In 2009, Hermenier et al. (Hermenier et al., 2009) introduce the Entropy resource manager, which is a constraint programming-based solution allowing for a dynamic server consolidation. It tackles both problems of finding the available servers, and migrating the VMs to these servers. This solution is only app

۰ ۰
[توسط مترجم]
[مهندسی صنایع]

Constraint Programming Model